The size of minimal blocking sets of Q(4, q)
نویسندگان
چکیده
Let Q(2n+2, q) denote the non-singular parabolic quadric in the projective geometry PG(2n+2, q). We describe the implementation in GAP of an algorithm to determine the minimal number of points of a minimal blocking set of Q(4, q), for q = 5, 7
منابع مشابه
Characterization results on small blocking sets
In [8], De Beule and Storme characterized the smallest blocking sets of the hyperbolic quadrics Q+(2n + 1, 3), n ≥ 4; they proved that these blocking sets are truncated cones over the unique ovoid of Q+(7, 3). We continue this research by classifying all the minimal blocking sets of the hyperbolic quadrics Q+(2n + 1, 3), n ≥ 3, of size at most 3n + 3n−2. This means that the three smallest minim...
متن کاملA spectrum result on minimal blocking sets with respect to the planes of PG(3, q), q odd
This article presents a spectrum result on minimal blocking sets with respect to the planes of PG(3, q) , q odd. We prove that for every integer k in an interval of, roughly, size [q 2 /4, 3q 2 /4] , there exists such a minimal blocking set of size k in PG(3, q) , q odd. A similar result on the spectrum of minimal blocking sets with respect to the planes of PG(3, q) , q even, was presented in [...
متن کاملBlocking Sets and Derivable Partial Spreads
We prove that a GF(q)-linear Rédei blocking set of size qt + qt−1 + · · · + q + 1 of PG(2, qt ) defines a derivable partial spread of PG(2t − 1, q). Using such a relationship, we are able to prove that there are at least two inequivalent Rédei minimal blocking sets of size qt + qt−1 + · · · + q + 1 in PG(2, qt ), if t ≥ 4.
متن کاملGroups With Maximal Irredundant Covers And Minimal Blocking Sets
Let n be a positive integer. Denote by PG(n, q) the n-dimensional projective space over the finite field Fq of order q. A blocking set in PG(n, q) is a set of points that has non-empty intersection with every hyperplane of PG(n, q). A blocking set is called minimal if none of its proper subsets are blocking sets. In this note we prove that if PG(ni, q) contains a minimal blocking set of size ki...
متن کاملThe use of blocking sets in Galois geometries and in related research areas
Blocking sets play a central role in Galois geometries. Besides their intrinsic geometrical importance, the importance of blocking sets also arises from the use of blocking sets for the solution of many other geometrical problems, and problems in related research areas. This article focusses on these applications to motivate researchers to investigate blocking sets, and to motivate researchers ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012